Dual-load Bloom filter: Application for name lookup
نویسندگان
چکیده
منابع مشابه
Using Bloom Filters to Speed-up Name Lookup in Distributed Systems
Bloom filters make use of a “probabilistic” hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its size and the probability that the filter returns the wrong result. It does this without storing the entire set, at the cost of occasionally incorrectly answering yes to the question “is x a member of s?”. The paper discusses how...
متن کاملPayload Inspection Using Parallel Bloom Filter in Dual Core Processor
This paper presents payload inspection for identification of spam files using bloom filter in dual core processor. Spam files flood the Internet in an attempt to dump the messages on recipients who do not intend to receive it. Spam costs the sender very little to send and most of the costs are levied to the recipients or the carriers. The proposed system identifies and filters the incoming spam...
متن کاملMessage Routing with Counting Bloom Filter for Name-Based Home Ad Hoc Networks
As future home appliances will have many useful built-in functions, a communication network that allows a user to access these built-in functions and to control the appliances is highly desirable. If the home appliances are fitted with a wireless communication module, a wireless ad hoc network can be used to easily connect the appliances. For ease of use the nodes are given names such as “livin...
متن کاملA Cuckoo Filter Modification Inspired by Bloom Filter
Probabilistic data structures are so popular in membership queries, network applications, and so on. Bloom Filter and Cuckoo Filter are two popular space efficient models that incorporate in set membership checking part of many important protocols. They are compact representation of data that use hash functions to randomize a set of items. Being able to store more elements while keeping a reaso...
متن کاملThe Gaussian Bloom Filter
Modern databases tailored to highly distributed, fault tolerant management of information for big data applications exploit a classical data structure for reducing disk and network I/O as well as for managing data distribution: The Bloom filter. This data structure allows to encode small sets of elements, typically the keys in a key-value store, into a small, constant-size data structure. In or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Communications
سال: 2020
ISSN: 0140-3664
DOI: 10.1016/j.comcom.2019.12.029